Pii: S0168-9274(99)00099-9
نویسندگان
چکیده
Problems in unbounded domains are often solved numerically by truncating the infinite domain via an artificial boundary B and applying some boundary condition on B, which is called a Non-Reflecting Boundary Condition (NRBC). Recently, a two-parameter hierarchy of optimal local NRBCs of increasing order has been developed. The optimality is in the sense that the local NRBC best approximates the exact nonlocal Dirichlet-to-Neumann (DtN) boundary condition in the L2 norm for functions in C∞. The optimal NRBCs are combined with finite element discretization in the computational domain. Here the theoretical properties of the resulting class of schemes are examined. In particular, theorems are proved regarding the numerical stability of the schemes and their rates of convergence. 2000 IMACS. Published by Elsevier Science B.V. All rights reserved.
منابع مشابه
Pii: S0168-9274(99)00020-3
We compare several methods for sensitivity analysis of differential–algebraic equations (DAEs). Computational complexity, efficiency and numerical conditioning issues are discussed. Numerical results for a chemical kinetics problem arising in model reduction are presented. 2000 IMACS. Published by Elsevier Science B.V. All rights reserved.
متن کاملPii: S0168-9274(01)00134-9
A postprocessing technique to improve the accuracy of Galerkin methods, when applied to dissipative partial differential equations, is examined in the particular case of very smooth solutions. Pseudospectral methods are shown to perform poorly. This performance is studied and a refined postprocessing technique is proposed. 2002 IMACS. Published by Elsevier Science B.V. All rights reserved.
متن کاملPii: S0168-9274(99)00131-2
We study numerical integrators that contract phase space volume even when the ODE does so at an arbitrarily small rate. This is done by a splitting into two-dimensional contractive systems. We prove a sufficient condition for Runge–Kutta methods to have the appropriate contraction property for these two-dimensional systems; the midpoint rule is an example. 2000 IMACS. Published by Elsevier Sc...
متن کاملPii: S0168-9274(99)00082-3
A fast Chebyshev–Fourier algorithm for Poisson-type equations in polar geometries is presented in this paper. The new algorithm improves upon the algorithm of Jie Shen (1997), by taking advantage of the odd–even parity of the Fourier expansion in the azimuthal direction, and it is shown to be more efficient in terms of CPU and memory. 2000 IMACS. Published by Elsevier Science B.V. All rights ...
متن کاملPii: S0168-9274(99)00114-2
This paper concerns the iterative solution of the linear system arising from the Chebyshev–collocation approximation of second-order elliptic equations and presents an optimal multigrid preconditioner based on alternating line Gauss–Seidel smoothers for the corresponding stiffness matrix of bilinear finite elements on the Chebyshev–Gauss–Lobatto grid. 2000 IMACS. Published by Elsevier Science...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2000